Fast non-blocking atomic commit: an inherent trade-off

Fast non-blocking atomic commit: an inherent trade-off

This paper investigates the time-complexity of the non-blocking atomic commit (NBAC) problem in a synchronous distributed model where t out of n processes may fail by crashing. We exhibit for t ≥ 3 an inherent trade-off between the fast abort property of NBAC, i.e., aborting a transaction as soon as possible if some process votes “no,” and the fast commit property, i.e., committing a transactio...

On the Weakest Failure Detector for Non-Blocking Atomic Commit

This paper addresses the question of the weakest failure detector to solve the Non-Blocking Atomic Commit (NBAC) problem in an asynchronous system. We define the set A of timeless failure detectors which excludes failure detectors that provide information about global time but includes all known meaningful failure detectors such as 3S , 3P and P [2]. We show that, within A, the weakest failure ...

Finally the Weakest Failure Detector for Non-Blocking Atomic Commit

Recent papers [7, 9] define the weakest failure detector for solving the Non-Blocking Atomic Commit problem (NBAC) in a message passing system where processes can fail by crashing and a majority of processes never crash. In this paper, we generalize the result by presenting the weakest failure detector to solve NBAC in any environment, i.e., without any assumption on the number of processes tha...

A Low-Latency Non-blocking Commit Service

Understanding Non-Blocking Atomic Commitment

In distributed database systems, an atomic commitment protocol ensures that transactions terminate consistently at all participating sites even in the presence of failures. An atomic commitment protocol is said to be non-blocking if it permits transaction termination to proceed at correct participants despite failures of others. Protocols that have this property are desirable since they limit t...